Scheduler-Quantified Time-Bounded Reachability for Distributed Input/Output Interactive Probabilistic Chains
نویسنده
چکیده
Acknowledgements Many people have helped getting this thesis to its present state. I sincerely thank them all. First of all, I would like to thank professor Holger Hermanns for bringing forth such an interesting topic of investigation. I am also grateful to professor Bernd Finkbeiner for the helpful recent discussions we've had and for accepting to be a reviewer of my thesis. I am especially thankful to Pepijn Crouzen, my advisor, for his always competent and timely suggestions and remarks, as well as for his calm straightforwardness, which helped greatly to keep my work on track. Thank you very much! Without the help of Ernst Moritz Hahn, Pedro D'Argenio and Lijun Zhang, much of the thesis content would not be as clear as one may find it now. You all have my gratitude! Furthermore, I would like to thank my colleagues and friends, and especially to Raphael Reischuk, Markus Rabe and Mihai Grigore for reading parts of my thesis and offering helpful advice which I truly value. Last, but certainly first in my heart, my deepest gratitude goes to my parents and elder sisters for their continued support during my studies. Thank you!
منابع مشابه
Time-Bounded Reachability in Distributed Input/Output Interactive Probabilistic Chains
We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results we consider the recently introduced class of (strongly) distributed schedulers, for which no analysis techniques are known. Our algorithm is based on reformulating the nondeterministic models as parametric ones, by interpreting...
متن کاملAnalysis and scheduler synthesis of time - bounded reachability in continuous - time Markov decision processes
Continuous-time Markov decision processes (CTMDPs) are stochastic models in which probabilistic and nondeterministic choices co-exist. Lately, a discretization technique has been developed to compute time-bounded reachability probabilities in locally uniform CTMDPs, i.e. CTMDPs with state-wise constant sojourn-times. We extend the underlying value iteration algorithm, such that it computes an -...
متن کاملProviding Evidence of Likely Being on Time
Probabilistic model checkers typically provide a list of individual state probabilities on the refutation of a temporal logic formula. For large state spaces, this information is far too detailed to act as useful diagnostic feedback. For quantitative (constrained) reachability problems, sets of paths that carry enough probability mass are more adequate. We recently have shown that in the contex...
متن کاملEfficient modelling, generation and analysis of Markov automata
Quantitative model checking is concerned with the verification of both quantitative and qualitative properties over models incorporating quantitative information. Increases in expressivity of the models involved allow more types of systems to be analysed, but also raise the difficulty of their efficient analysis. Three years ago, the Markov automaton (MA) was introduced as a generalisation of p...
متن کاملCompositional Verification and Optimization of Interactive Markov Chains
Interactive Markov chains (IMC) are compositional behavioural models extending labelled transition systems and continuous-time Markov chains. We provide a framework and algorithms for compositional verification and optimization of IMC with respect to time-bounded properties. Firstly, we give a specification formalism for IMC. Secondly, given a time-bounded property, an IMC component and the ass...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012